0.12/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.14/0.17	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.17/0.39	% Computer   : n007.cluster.edu
0.17/0.39	% Model      : x86_64 x86_64
0.17/0.39	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.39	% Memory     : 8042.1875MB
0.17/0.39	% OS         : Linux 3.10.0-693.el7.x86_64
0.17/0.39	% CPULimit   : 1200
0.17/0.39	% WCLimit    : 120
0.17/0.39	% DateTime   : Tue Jul 13 15:36:19 EDT 2021
0.17/0.39	% CPUTime    : 
0.17/0.39	% Number of cores: 8
0.17/0.39	% Python version: Python 3.6.8
0.17/0.40	# Version: 2.6rc1-ho
0.17/0.41	# No SInE strategy applied
0.17/0.41	# Trying AutoSched0 for 59 seconds
5.38/5.60	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S2g
5.38/5.60	# and selection function SelectCQArNpEqFirst.
5.38/5.60	#
5.38/5.60	# Preprocessing time       : 0.103 s
5.38/5.60	# Presaturation interreduction done
5.38/5.60	
5.38/5.60	# Proof found!
5.38/5.60	# SZS status Theorem
5.38/5.60	# SZS output start CNFRefutation
5.38/5.60	thf(fact_11_finite__Collect__conjI, axiom, ![X92:real > $o, X93:real > $o]:(finite_finite_real @ (collect_real @ (^[X94:real]:(X93 @ X94&X92 @ X94)))<=(finite_finite_real @ (collect_real @ X93)|finite_finite_real @ (collect_real @ X92))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_11_finite__Collect__conjI)).
5.38/5.60	thf(fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062, axiom, finite_finite_real @ (collect_real @ (^[X629:real]:(poly_real2 @ p @ X629)=(zero_zero_real))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062)).
5.38/5.60	thf(conj_0, conjecture, finite_finite_real @ (collect_real @ (^[X73:real]:(((poly_real2 @ p @ X73)=(zero_zero_real)&ord_less_real @ a @ X73)&ord_less_real @ X73 @ b))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
5.38/5.60	thf(c_0_3, plain, ![X94:real, X92:real > $o, X93:real > $o]:(epred5_3 @ X93 @ X92 @ X94<=>(X93 @ X94&X92 @ X94)), introduced(definition)).
5.38/5.60	thf(c_0_4, plain, ![X92:real > $o, X93:real > $o]:((finite_finite_real @ (collect_real @ X93)|finite_finite_real @ (collect_real @ X92))=>finite_finite_real @ (collect_real @ (epred5_3 @ X93 @ X92))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[fact_11_finite__Collect__conjI, c_0_3])])).
5.38/5.60	thf(c_0_5, plain, ![X141:real, X140:poly_real]:(epred7_2 @ X140 @ X141<=>(poly_real2 @ X140 @ X141)=(zero_zero_real)), introduced(definition)).
5.38/5.60	thf(c_0_6, plain, ![X73:real]:(epred3_1 @ X73<=>(((poly_real2 @ p @ X73)=(zero_zero_real)&ord_less_real @ a @ X73)&ord_less_real @ X73 @ b)), introduced(definition)).
5.38/5.60	thf(c_0_7, plain, ![X1766:real > $o, X1767:real > $o]:((~finite_finite_real @ (collect_real @ X1767)|finite_finite_real @ (collect_real @ (epred5_3 @ X1767 @ X1766)))&(~finite_finite_real @ (collect_real @ X1766)|finite_finite_real @ (collect_real @ (epred5_3 @ X1767 @ X1766)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
5.38/5.60	thf(c_0_8, axiom, finite_finite_real @ (collect_real @ (epred7_2 @ p)), inference(apply_def,[status(thm)],[fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062, c_0_5])).
5.38/5.60	thf(c_0_9, negated_conjecture, ~finite_finite_real @ (collect_real @ epred3_1), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0]), c_0_6])])).
5.38/5.60	thf(c_0_10, plain, ![X43:real > $o, X42:real > $o]:(finite_finite_real @ (collect_real @ (epred5_3 @ X43 @ X42))|~finite_finite_real @ (collect_real @ X42)), inference(split_conjunct,[status(thm)],[c_0_7])).
5.38/5.60	thf(c_0_11, plain, finite_finite_real @ (collect_real @ (epred7_2 @ p)), inference(split_conjunct,[status(thm)],[c_0_8])).
5.38/5.60	thf(c_0_12, negated_conjecture, ~finite_finite_real @ (collect_real @ epred3_1), inference(split_conjunct,[status(thm)],[c_0_9])).
5.38/5.60	thf(c_0_13, plain, ![X42:real > $o]:finite_finite_real @ (collect_real @ (epred5_3 @ X42 @ (epred7_2 @ p))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
5.38/5.60	thf(c_0_14, plain, ![X42:real > $o]:(epred5_3 @ X42 @ (epred7_2 @ p))!=(epred3_1), inference(ext_sup,[status(thm)],[c_0_12, c_0_13])).
5.38/5.60	thf(c_0_15, plain, ![X2734:real, X2735:real > $o, X2736:real > $o]:(((X2736 @ X2734|~epred5_3 @ X2736 @ X2735 @ X2734)&(X2735 @ X2734|~epred5_3 @ X2736 @ X2735 @ X2734))&(~X2736 @ X2734|~X2735 @ X2734|epred5_3 @ X2736 @ X2735 @ X2734)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
5.38/5.60	thf(c_0_16, plain, ![X42:real > $o]:(epred5_3 @ X42 @ (epred7_2 @ p) @ (esk230_1 @ X42))!=(epred3_1 @ (esk230_1 @ X42)), inference(neg_ext,[status(thm)],[c_0_14])).
5.38/5.60	thf(c_0_17, plain, ![X43:real > $o, X42:real > $o, X9:real]:(X42 @ X9|~epred5_3 @ X42 @ X43 @ X9), inference(split_conjunct,[status(thm)],[c_0_15])).
5.38/5.61	thf(c_0_18, plain, ![X42:real > $o]:(epred5_3 @ X42 @ (epred7_2 @ p) @ (esk230_1 @ X42)|epred3_1 @ (esk230_1 @ X42)), inference(dynamic cnf,[status(thm)],[c_0_16])).
5.38/5.61	thf(c_0_19, plain, ![X2730:real]:(((((poly_real2 @ p @ X2730)=(zero_zero_real)|~epred3_1 @ X2730)&(ord_less_real @ a @ X2730|~epred3_1 @ X2730))&(ord_less_real @ X2730 @ b|~epred3_1 @ X2730))&((poly_real2 @ p @ X2730)!=(zero_zero_real)|~ord_less_real @ a @ X2730|~ord_less_real @ X2730 @ b|epred3_1 @ X2730)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
5.38/5.61	thf(c_0_20, plain, ![X42:real > $o]:(epred3_1 @ (esk230_1 @ X42)|X42 @ (esk230_1 @ X42)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
5.38/5.61	thf(c_0_21, plain, ![X2739:real, X2740:poly_real]:((~epred7_2 @ X2740 @ X2739|(poly_real2 @ X2740 @ X2739)=(zero_zero_real))&((poly_real2 @ X2740 @ X2739)!=(zero_zero_real)|epred7_2 @ X2740 @ X2739)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
5.38/5.61	thf(c_0_22, plain, ![X9:real]:((poly_real2 @ p @ X9)=(zero_zero_real)|~epred3_1 @ X9), inference(split_conjunct,[status(thm)],[c_0_19])).
5.38/5.61	thf(c_0_23, plain, epred3_1 @ (esk230_1 @ epred3_1), inference(ef,[status(thm)],[c_0_20])).
5.38/5.61	thf(c_0_24, plain, ![X22:poly_real, X9:real]:(epred7_2 @ X22 @ X9|(poly_real2 @ X22 @ X9)!=(zero_zero_real)), inference(split_conjunct,[status(thm)],[c_0_21])).
5.38/5.61	thf(c_0_25, plain, (poly_real2 @ p @ (esk230_1 @ epred3_1))=(zero_zero_real), inference(spm,[status(thm)],[c_0_22, c_0_23])).
5.38/5.61	thf(c_0_26, plain, ![X43:real > $o, X42:real > $o, X9:real]:(epred5_3 @ X42 @ X43 @ X9|~X42 @ X9|~X43 @ X9), inference(split_conjunct,[status(thm)],[c_0_15])).
5.38/5.61	thf(c_0_27, plain, epred7_2 @ p @ (esk230_1 @ epred3_1), inference(spm,[status(thm)],[c_0_24, c_0_25])).
5.38/5.61	thf(c_0_28, plain, ![X42:real > $o]:(epred5_3 @ X42 @ (epred7_2 @ p) @ (esk230_1 @ epred3_1)|~X42 @ (esk230_1 @ epred3_1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
5.38/5.61	thf(c_0_29, plain, ![X42:real > $o]:(~epred5_3 @ X42 @ (epred7_2 @ p) @ (esk230_1 @ X42)|~epred3_1 @ (esk230_1 @ X42)), inference(dynamic cnf,[status(thm)],[c_0_16])).
5.38/5.61	thf(c_0_30, plain, epred5_3 @ epred3_1 @ (epred7_2 @ p) @ (esk230_1 @ epred3_1), inference(spm,[status(thm)],[c_0_28, c_0_23])).
5.38/5.61	thf(c_0_31, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_23])]), ['proof']).
5.38/5.61	# SZS output end CNFRefutation
5.38/5.61	# Proof object total steps             : 32
5.38/5.61	# Proof object clause steps            : 19
5.38/5.61	# Proof object formula steps           : 13
5.38/5.61	# Proof object conjectures             : 3
5.38/5.61	# Proof object clause conjectures      : 1
5.38/5.61	# Proof object formula conjectures     : 2
5.38/5.61	# Proof object initial clauses used    : 7
5.38/5.61	# Proof object initial formulas used   : 3
5.38/5.61	# Proof object generating inferences   : 8
5.38/5.61	# Proof object simplifying inferences  : 2
5.38/5.61	# Training examples: 0 positive, 0 negative
5.38/5.61	# Parsed axioms                        : 426
5.38/5.61	# Removed by relevancy pruning/SinE    : 0
5.38/5.61	# Initial clauses                      : 1158
5.38/5.61	# Removed in clause preprocessing      : 124
5.38/5.61	# Initial clauses in saturation        : 1034
5.38/5.61	# Processed clauses                    : 19543
5.38/5.61	# ...of these trivial                  : 1977
5.38/5.61	# ...subsumed                          : 3643
5.38/5.61	# ...remaining for further processing  : 13923
5.38/5.61	# Other redundant clauses eliminated   : 2028
5.38/5.61	# Clauses deleted for lack of memory   : 0
5.38/5.61	# Backward-subsumed                    : 122
5.38/5.61	# Backward-rewritten                   : 72
5.38/5.61	# Generated clauses                    : 487872
5.38/5.61	# ...of the previous two non-trivial   : 407418
5.38/5.61	# Contextual simplify-reflections      : 57
5.38/5.61	# Paramodulations                      : 446296
5.38/5.61	# Factorizations                       : 22
5.38/5.61	# NegExts                              : 465
5.38/5.61	# Equation resolutions                 : 2034
5.38/5.61	# Propositional unsat checks           : 0
5.38/5.61	#    Propositional check models        : 0
5.38/5.61	#    Propositional check unsatisfiable : 0
5.38/5.61	#    Propositional clauses             : 0
5.38/5.61	#    Propositional clauses after purity: 0
5.38/5.61	#    Propositional unsat core size     : 0
5.38/5.61	#    Propositional preprocessing time  : 0.000
5.38/5.61	#    Propositional encoding time       : 0.000
5.38/5.61	#    Propositional solver time         : 0.000
5.38/5.61	#    Success case prop preproc time    : 0.000
5.38/5.61	#    Success case prop encoding time   : 0.000
5.38/5.61	#    Success case prop solver time     : 0.000
5.38/5.61	# Current number of processed clauses  : 12819
5.38/5.61	#    Positive orientable unit clauses  : 3240
5.38/5.61	#    Positive unorientable unit clauses: 0
5.38/5.61	#    Negative unit clauses             : 3072
5.38/5.61	#    Non-unit-clauses                  : 6507
5.38/5.61	# Current number of unprocessed clauses: 389467
5.38/5.61	# ...number of literals in the above   : 826206
5.38/5.61	# Current number of archived formulas  : 0
5.38/5.61	# Current number of archived clauses   : 1012
5.38/5.61	# Clause-clause subsumption calls (NU) : 2910116
5.38/5.61	# Rec. Clause-clause subsumption calls : 1740957
5.38/5.61	# Non-unit clause-clause subsumptions  : 1948
5.38/5.61	# Unit Clause-clause subsumption calls : 2653905
5.38/5.61	# Rewrite failures with RHS unbound    : 0
5.38/5.61	# BW rewrite match attempts            : 12809
5.38/5.61	# BW rewrite match successes           : 91
5.38/5.61	# Condensation attempts                : 0
5.38/5.61	# Condensation successes               : 0
5.38/5.61	# Termbank termtop insertions          : 6837029
5.44/5.62	
5.44/5.62	# -------------------------------------------------
5.44/5.62	# User time                : 5.054 s
5.44/5.62	# System time              : 0.176 s
5.44/5.62	# Total time               : 5.229 s
5.44/5.62	# Maximum resident set size: 2616 pages
5.44/5.63	EOF